Task Rearrangement on Partially Reconfigurable FPGAs with Restricted Buffer

Partially reconngurable FPGAs can be shared among multiple independent tasks. When partial reconnguration is possible at run-time the FPGA controller can decide on-line were to place new tasks on the FPGA. Since on{line allocation suuers from fragmentation, tasks can end up waiting despite there being suucient, albeit non{contiguous resources available to service them. Rearranging a subset of the tasks executing on the FPGA often allows the next pending task to be processed sooner. In this paper we study the problem of placing and rearranging tasks that are supplied by input streams which have constant data rates. When such tasks are rearranged, the arriving input data have to be buuered while the execution is suspended. We describe and evaluate a genetic algorithm for identifying and scheduling feasible rearrangements when moving tasks are reloaded from oo{chip and buuer size is limited.